Computing minimum-area rectilinear convex hull and L-shape
نویسندگان
چکیده
منابع مشابه
Computing minimum-area rectilinear convex hull and L-shape
Article history: Received 21 February 2008 Accepted 24 February 2009 Available online 24 March 2009 Communicated by T. Asano
متن کاملRectilinear Convex Hull with Minimum Area
Let P be a set of n points in the plane. We solve the problem of computing the orientations for which the rectilinear convex hull of P has minimum area in optimal ⇥(n log n) time and O(n) space. Introduction The interest in the rectilinear convex hull of planar point sets arises from the study of ortho-convexity [10], a relaxation of traditional convexity. Unlike convex regions, an ortho-convex...
متن کاملRectilinear and O-convex hull with minimum area
Let P be a set of n points in the plane and O be a set of k lines passing through the origin. We show: (1) How to compute the O-hull of P in Θ(n log n) time and O(n) space, (2) how to compute and maintain the rotated hull OHθ(P ) for θ ∈ [0, 2π) in O(kn log n) time and O(kn) space, and (3) how to compute in Θ(n log n) time and O(n) space a value of θ for which the rectilinear convex hull, RHθ(P...
متن کاملConvex Hull Asymptotic Shape Evolution
The asymptotic properties of Rapidly exploring Random Tree (RRT) growth in large spaces is studied both in simulation and analysis. The main phenomenon is that the convex hull of the RRT reliably evolves into an equilateral triangle when grown in a symmetric planar region (a disk). To characterize this and related phenomena from flocking and swarming, a family of dynamical systems based on incr...
متن کاملMinimum Pseudo-Triangulation Using Convex Hull Layers
Pseudo-triangulation is regarded as one of the most commonly used problems in computational geometry. In this paper we consider the problem of minimum pseudotriangulation of a given set of points S in the plane using convex hull layers and we propose two new methods that will lead to the production of minimum pseudo-triangulation. This means that the number of pseudo-triangles created in minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2009
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2009.02.006